Spring Embedder Preprocessing for WWW Visualization

نویسندگان

  • Paul Mutton
  • Peter Rodgers
چکیده

We present a preprocessor for the spring embedder graph drawing method and show its use in speeding up the automatic layout of three-dimensional visualizations of WWW sites. Spring embedding is a widely used method for visualizing the connections in WWW maps, as it can typically produce a reasonable layout for most general graphs. However, the technique does not scale well and to improve the performance when dealing with large graphs various optimisations have been developed. Our preprocessor is a new optimization method that attempts to obtain a reasonably good initial drawing to be then used by the spring embedder. This initial drawing has edge lengths that are approximately equal along with a minimum node separation. This produces a layout that is closer to the final drawing than a random scattering of nodes and so allows fewer invocations of the spring embedder to produce an equally stable drawing.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Demonstration of a Preprocessor for the Spring Embedder

Spring embedding is a widely used method for producing automated layouts of graphs. We present a preprocessor that improves the performance of the classical spring embedder, which can be used in conjunction with other optimization and approximation techniques. It creates an initial graph layout with edge lengths that are approximately equal and with a minimum node separation from which the spri...

متن کامل

Planar Preprocessing for Spring Embedders

Abstract. Spring embedders are conceptually simple and produce straight-line drawings with an undeniable aesthetic appeal, which explains their prevalence when it comes to automated graph drawing. However, when drawing planar graphs, spring embedders often produce non-plane drawings, as edge crossings do not factor into the objective function being minimized. On the other hand, there are fairly...

متن کامل

Improving Interactive Information Retrieval Effectiveness with 3-D Graphics

Recall-oriented information retrieval requires locating as many documents as possible that are relevant to a query. Traditional information retrieval systems present results only in a ranked list. Inspired by the cluster hypothesis, we present a novel 3-D visualization tool which aids recalloriented retrieval. The visualization portrays clustered documents and concepts using a modified spring e...

متن کامل

Visualizing Phylogenetic Trees by Spring-Embedder Models

A phylogenetic tree is a graphical representation of the evolutionary relationship between taxonomic groups. The term phylogeny refers to the evolution or historical development of a plant or animal species, or even a human tribe or similar group. In order to make ourself to understand the structure of phylogenetic tree. We present a spring-embedder model for drawing rooted and unrooted phyloge...

متن کامل

From Tree to Graph - Experiments with E-Spring Algorithm

Graph drawing and visualization represent structural information as diagrams of abstract graphs and networks. E-Spring Algorithm, derived from the popular spring embedder model, was proposed to eliminate node overlaps in the drawings of clustered directed acyclic graphs Gc. In this paper, we apply the E-Spring algorithm to general graphs by minimizing edge-node intersections. Initially, a tree ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002